Approximate functional complexity
نویسندگان
چکیده
منابع مشابه
The Complexity of Approximate
We study the approximability of the following NP-complete (in their feasibility recognition forms) number theoretic optimization problems: 1. x 2 Z n with minimum max 1in jxij satisfying P n i=1 xiai = gcd(a1; : : : ; an). We present a polynomial-time algorithm which approximates a minimum gcd set for a1; : : : ; an within a factor 1+ln n and prove that this algorithm is best possible in the se...
متن کاملApproximate mixed additive and quadratic functional in 2-Banach spaces
In the paper we establish the general solution of the function equation f(2x+y)+f(2x-y) = f(x+y)+f(x-y)+2f(2x)-2f(x) and investigate the Hyers-Ulam-Rassias stability of this equation in 2-Banach spaces.
متن کاملApproximate and Multipartite Quantum Correlation (Communication) Complexity
The concepts of quantum correlation and communication complexity have been proposed to quantify the worst-case computational resources needed in generating bipartite classical distributions or bipartite quantum states in the single-shot setting by Zhang (Proc. 3rd Innov Theor Comput., pp. 39-59, 2012). The former characterizes the minimal size of the initial shared state needed if no communicat...
متن کاملOn the parameterized complexity of approximate counting
In this paper we study the parameterized complexity of approximating the parameterized counting problems contained in the class #W [P ] ; the parameterized analogue of #P: We prove a parameterized analogue of a famous theorem of Stockmeyer claiming that approximate counting belongs to the second level of the polynomial hierarchy.
متن کاملApproximate Real Function Maximization and Query Complexity
Consider the problem of approximate function maximization: Given a continuous real function with domain [0, 1], what is its approximate maximum of absolute error 2−n? More precisely, we are interested in the complexity of approximating the real functional MAX : C[0,1] 3 f 7→max0≤x≤1 ∈ R up to a prescribed absolute error 2−n. Regarding the complexity, we examine quantitative and parameterized bo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Bulletin of the American Mathematical Society
سال: 1975
ISSN: 0002-9904
DOI: 10.1090/s0002-9904-1975-13938-3